Constructing and Joining Maximum Likelihood Genetic Maps
نویسندگان
چکیده
We present CART HAGENE a new piece of software for genetic mapping. Compared to existing genetic mapping softwares, CART HAGENE has both strengths and weaknesses. The most important weakness is certainly its actual limitation to backcross-like pedigree. However, when CART HAGENE applies, it is able to order markers and produce maximum multipoint likelihood marker maps with a large number of markers (eg. > 30) and a large percentage of missing data (eg. > 50%). This is done using optimization techniques originating from the artificial intelligence and operations research communities, hybridized with the usual statistical optimization algorithm EM. When a large number of markers are present, CART HAGENE offers a service comparable to the compare exhaustive search command of MAPMAKER at reasonable cost. More interestingly, when several data sets on the same organism are available, each with a different set of informative markers, CART HAGENE allows to automatically build maximum multipoint likelihood joined maps. On this type of problems, CART HAGENE compares favorably to JOINMAP, a much more general package dedicated to this type of problem. CART HAGENE has been used to build the first joined maps for the wasp Trichogramma brassicae and has also been assessed on randomly generated problems.
منابع مشابه
HAGENE: Constructing and Joining Maximum Likelihood Genetic Maps
Genetic mapping is an important step in the study of any organism. An accurate genetic map is extremely valuable for locating genes or more generally either qualitative or quantitative trait loci (QTL). This paper presents a new approach to two important problems in genetic mapping: automatically ordering markers to obtain a multipoint maximum likelihood map and building a multipoint maximum li...
متن کاملCARTHAGENE: Constructing and Joining Maximum Likelihood Genetic Maps
Genetic mapping is an important step in the study of any organism. An accurate genetic map is extremely valuable for locating genes or more generally either qualitative or quantitative trait loci (QTL). This paper presents a new approach to two important problems in genetic mapping: automatically ordering markers to obtain a multipoint maximum likelihood map and building a multipoint maximum li...
متن کاملconstNJ: An Algorithm to Reconstruct Sets of Phylogenetic Trees Satisfying Pairwise Topological Constraints
This article introduces constNJ (constrained neighbor-joining), an algorithm for phylogenetic reconstruction of sets of trees with constrained pairwise rooted subtree-prune-regraft (rSPR) distance. We are motivated by the problem of constructing sets of trees that must fit into a recombination, hybridization, or similar network. Rather than first finding a set of trees that are optimal accordin...
متن کاملConstruction of multilocus genetic linkage maps in humans.
Human genetic linkage maps are most accurately constructed by using information from many loci simultaneously. Traditional methods for such multilocus linkage analysis are computationally prohibitive in general, even with supercomputers. The problem has acquired practical importance because of the current international collaboration aimed at constructing a complete human linkage map of DNA mark...
متن کاملConstruction of Phylogenetic Trees from Amino Acid Sequences using a Genetic Algorithm
We have developed a novel algorithm to search for the maximum likelihood tree constructed from amino acid sequences. This algorithm is a variant of genetic algorithms which uses scores derived from the log-likelihood of trees computed by the maximum likelihood method. This algorithm is valuable since it may construct more likely tree from randomly generated trees by utilizing crossover and muta...
متن کامل